The Decidability of Simultaneous Rigid E-Uni cation with One Variable
نویسندگان
چکیده
We show that simultaneous rigid E-uni cation, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classi cation of decidability of the prenex fragment of intuitionistic logic with equality, in terms of the quanti er pre x. It is also proved that SREU with one variable and a constant bound on the number of rigid equations is Pcomplete.
منابع مشابه
Decidability and Complexity of Simultaneous Rigid E-Uni cation with One Variable and Related Results
We show that simultaneous rigid E-uni cation, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classi cation of decidability of the prenex fragment of intuitio...
متن کاملMonadic Simultaneous Rigid E-Uni cation and Related Problems
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.
متن کاملThe Decidability of Simultaneous RigidE - Uni cation with One
We show that simultaneous rigid E-uniication, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classiication of decidability of the prenex fragment of intuitio...
متن کاملMonadic Simultaneous Rigid E-Unification and Related Problems
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem. 1 Section
متن کاملOn Uni cation Problems in Restricted Second-Order Languages
We review known results and improve known boundaries between the decidable and the undecidable cases of second-order uniication with restrictions on the number, the number of occurrences, and the arity of second-order variables. As a key tool we prove an unde-cidability result that provides a partial solution to an open problem regarding decidability of simultaneous rigid E-uniication with two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002